An Efficient Algorithm for Learning Dictionary under Coherence Constraint

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dictionary learning under global sparsity constraint

A new method is proposed in this paper to learn overcomplete dictionary from training data samples. Differing from the current methods that enforce similar sparsity constraint on each of the input samples, the proposed method attempts to impose global sparsity constraint on the entire data set. This enables the proposed method to fittingly assign the atoms of the dictionary to represent various...

متن کامل

An Analysis Dictionary Learning Algorithm under a Noisy Data Model with Orthogonality Constraint

Two common problems are often encountered in analysis dictionary learning (ADL) algorithms. The first one is that the original clean signals for learning the dictionary are assumed to be known, which otherwise need to be estimated from noisy measurements. This, however, renders a computationally slow optimization process and potentially unreliable estimation (if the noise level is high), as rep...

متن کامل

Integrating Principal Component Analysis and Dictionary Learning with Coherence Constraint for Fast T1ρ Mapping

Integrating Principal Component Analysis and Dictionary Learning with Coherence Constraint for Fast T1ρ Mapping Yanjie Zhu, Qiegen Liu, Qinwei Zhang, Jing Yuan, and Dong Liang Paul C. Lauterbur Research Centre for Biomedical Imaging, Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, Guangdong, China, Department of Electronic Information Engineering, Nanchang Uni...

متن کامل

A Batchwise Monotone Algorithm for Dictionary Learning

We propose a batchwise monotone algorithm for dictionary learning. Unlike the state-of-the-art dictionary learning algorithms which impose sparsity constraints on a sample-by-sample basis, we instead treat the samples as a batch, and impose the sparsity constraint on the whole. The benefit of batchwise optimization is that the non-zeros can be better allocated across the samples, leading to a b...

متن کامل

An efficient diagnosis algorithm for inconsistent constraint sets

Constraint sets can become inconsistent in different contexts. For example, during a configuration session the set of customer requirements can become inconsistent with the configuration knowledge base. Another example is the engineering phase of a configuration knowledge base where the underlying constraints can become inconsistent with a set of test cases. In such situations we are in the nee...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2016

ISSN: 1024-123X,1563-5147

DOI: 10.1155/2016/5737381